The LVS parametric tadpole constraint
نویسندگان
چکیده
A bstract The large volume scenario (LVS) for de Sitter compactifications of the type IIB string is, at least in principle, well protected from various unknown corrections. reason is that, by construction, Calabi-Yau exponentially large. However, as has recently been emphasised, practice most explicit models are rather on border parametric control. We identify and quantify parametrically what we believe to be main issue behind this difficulty. Namely, a implies shallow AdS minimum hence small uplift. latter, if it relies an anti-D3 throat, requires negative tadpole. As our result, provide simple formula tadpole order control dangerous fundamental ingredients parameters specifying desired quality comment interplay between constraint conjecture. also discuss directions future work which could lead LVS constructions satisfying with better control, further challenges that may exist LVS. Our then represents very concrete challenge searches understanding relevant geometries.
منابع مشابه
Constraint-Based Type Inference and Parametric Polymorphism
Constraint-based analysis is a technique for inferring implementation types. Traditionally it has been described using mathematical formalisms. We explain it in a different and more intuitive way as a flow problem. The intuition is facilitated by a direct correspondence between run-time and analysis-time concepts. Precise analysis of polymorphism is hard; several algorithms have been developed ...
متن کاملGeometric Constraint Solving in Parametric CAD
With parametric Computer-Aided Design (CAD) software, designers can create geometric models that are easily updated (within limits) by modifying the values of controlling parameters. These numeric and non-numeric parameters control the geometry in two ways: (i) parametric operations, and (ii) geometric constraint solving. This paper examines the advances over the last decade in the representati...
متن کاملConstraint-based parametric conics for CAD
Current commercial CAD systems allow constraint-based profile sketching. Algebraic constructive solvers are among the fastest algorithms for solving the resulting systems of geometric constraints. Such solvers decompose the system of nonlinear equations describing the constraints into small subsystems that correspond to simple construction steps. The repertoire of geometric elements supported b...
متن کاملA Constraint Logic Programming Systemwith Parametric Domain
Current implementations of constraint logic programming languages (like CLP(<), CHIP or RISC-CLP(Real) support constraint solving over a certain xed domain. In this paper a system is presented which gives the possibility to instantiate a constraint logic programming language with an arbitrary constraint domain. The interface between the system and such a constraint domain is given and the exten...
متن کاملMulticast-Based Distributed LVS (MD-LVS) for Improving Scalability and Availability
Clustering with a single -system image view is the most commonly used approach to increase throughput of a Web site. There are two types of clustering architecture: centralized IP cluster and distributed IP cluster. In centralized IP cluster, Load Balancer distributes incoming requests of clients to an appropriate Real Server based on load characteristics. However, the availability and scalabil...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of High Energy Physics
سال: 2022
ISSN: ['1127-2236', '1126-6708', '1029-8479']
DOI: https://doi.org/10.1007/jhep07(2022)056